Robust Vacuity for Branching Temporal Logic
نویسندگان
چکیده
منابع مشابه
Enhanced Vacuity Detection in Linear Temporal Logic
One of the advantages of temporal-logic model-checking tools is their ability to accompany a negative answer to a correctness query with a counterexample to the satisfaction of the specification in the system. On the other hand, when the answer to the correctness query is positive, most model-checking tools provide no witness for the satisfaction of the specification. In the last few years ther...
متن کاملTemporal Antecedent Failure: Refining Vacuity
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in practical applications are considered a problem by the system verifier. The second shows that vacuity detection for certain logics can be very complex and time consuming. This brings vacuity detection into an undesirable ...
متن کاملRobust Linear Temporal Logic
Although it is widely accepted that every system should be robust, in the sense that “small” violations of environment assumptions should lead to “small” violations of system guarantees, it is less clear how to make this intuitive notion of robustness mathematically precise. In this paper, we address the problem of how to specify robustness in temporal logic. Our solution consists of a robust v...
متن کاملAn Extended Branching-Time Ockhamist Temporal Logic
For branching-time temporal logic based on an Ockhamist semantics, we explore a temporal language extended with two additional syntactic tools. For reference to the set of all possible futures at a moment of time we use syntactically designated “restricted variables” called fan-names. For reference to all possible futures alternative to the actual one we use a modification of a difference modal...
متن کاملBranching-Time Temporal Logic and Tree Automata
JJ89] C. Jard and T. Jeron. On-line model-checking for nite linear temporal logic speciications. 6 Conclusions In this paper we showed that tree automata, which have been considered unsuitable for branching-time model checking, provide a neat and optimal framework for branching-time temporal logics and can handle, eeciently, model checking. The crucial point in our method is that when branching...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2012
ISSN: 1529-3785,1557-945X
DOI: 10.1145/2071368.2071369